Extrapolation methods for fixed‐point multilinear PageRank computations
نویسندگان
چکیده
منابع مشابه
Multilinear PageRank
In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a computationally tractable approximation to the higher-order PageRank vector that involves a system of polynomial equations called multilinear PageRank. This...
متن کاملImplicit Extrapolation Methods for Multilevel Finite Element Computations
Extrapolation methods for the solution of partial diierentialequations are commonly based on the existence of error expansions for the approximate solution. Implicit extrapolation, in the contrast, is based on applying extrapolation indirectly, by using it on quantities like the residual. In the context of multigrid methods, a special technique of this type is known as-extrapolation. For nite e...
متن کاملRational extrapolation for the PageRank vector
An important problem in web search is to determine the importance of each page. From the mathematical point of view, this problem consists in finding the nonnegative left eigenvector of a matrix corresponding to its dominant eigenvalue 1. Since this matrix is neither stochastic nor irreducible, the power method has convergence problems. So, the matrix is replaced by a convex combination, depend...
متن کاملComputing PageRank using Power Extrapolation
We present a novel technique for speeding up the computation of PageRank, a hyperlink-based estimate of the “importance” of Web pages, based on the ideas presented in [7]. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph. The algorithm presented here, called Power ...
متن کاملA Sublinear Time Algorithm for PageRank Computations
In a network, identifying all vertices whose PageRank is more than a given threshold value ∆ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When given a directed network G = (V,E), a threshold value ∆, and a positive constant c > 3, with probability 1 − o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2020
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.2280